An Improved Fireworks Algorithm Based on Grouping Strategy of the Shuffled Frog Leaping Algorithm to Solve Function Optimization Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Fireworks Algorithm Based on Grouping Strategy of the Shuffled Frog Leaping Algorithm to Solve Function Optimization Problems

Yu-Feng Sun 1, Jie-Sheng Wang 1,2,* and Jiang-Di Song 1 1 School of Electronic and Information Engineering, University of Science and Technology Liaoning, Anshan 114044, China; [email protected] (Y.-F.S.); [email protected] (J.-D.S.) 2 National Financial Security and System Equipment Engineering Research Center, University of Science and Technology Liaoning, Anshan 114044, China * Correspondence: ...

متن کامل

An Improved Shuffled Frog Leaping Algorithm ⋆

In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficie...

متن کامل

Adaptive Grouping Cloud Model Shuffled Frog Leaping Algorithm for Solving Continuous Optimization Problems

The shuffled frog leaping algorithm (SFLA) easily falls into local optimum when it solves multioptimum function optimization problem, which impacts the accuracy and convergence speed. Therefore this paper presents grouped SFLA for solving continuous optimization problems combined with the excellent characteristics of cloud model transformation between qualitative and quantitative research. The ...

متن کامل

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results...

متن کامل

Adaptive Grouping Quantum Inspired Shuffled Frog Leaping Algorithm

--------------------------------------------------------ABSTRACT----------------------------------------------------------To enhance the optimization ability of classical shuffled frog leaping algorithm, a quantum inspired shuffled frog leaping algorithm with adaptive grouping is proposed. In this work, the frog swarms are adaptive grouped according to the average value of the objective functio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2016

ISSN: 1999-4893

DOI: 10.3390/a9020023